Design of Gaussian Normal and Polynomial Basis Multipliers over Gf(2)
نویسندگان
چکیده
This article address efficient hardware implementations for multiplication over GF(2). Hardware implementations of multiplication algorithms are suitable for elliptic curve cryptoprocessor designs, which allow that elliptic curve based cryptosystems implemented in hardware provide more physical security and higher speed than software implementations. In this case, the multipliers were designed using conventional, modified and fast multiplication algorithms, the synthesis and simulation were carried out using Quartus II v.5.0 of Altera, and the designs were synthesized on the Stratix II EP2S60F1020C3. The simulation results show that the multipliers designed present a very good performance using small area. DESIGN OF GAUSSIAN NORMAL AND POLYNOMIAL BASIS MULTIPLIERS OVER GF(2) Vladimir Trujillo-Olaya, Jaime Velasco-Medina, Julio C. López-Hernández* Grupo de Bionanoelectrónica, Escuela EIEE, Universidad del Valle, Cali, Colombia * Instituto de computacao, UNICAMP, Campinas, Brasil E-mail: [email protected], [email protected], [email protected] ABSTRACT This article address efficient hardware implementations for multiplication over GF(2). Hardware implementations of multiplication algorithms are suitable for elliptic curve cryptoprocessor designs, which allow that elliptic curve based cryptosystems implemented in hardware provide more physical security and higher speed than software implementations. In this case, the multipliers were designed using conventional, modified and fast multiplication algorithms, the synthesis and simulation were carried out using Quartus II v.5.0 of Altera, and the designs were synthesized on the Stratix II EP2S60F1020C3. The simulation results show that the multipliers designed present a very good performance using small area.This article address efficient hardware implementations for multiplication over GF(2). Hardware implementations of multiplication algorithms are suitable for elliptic curve cryptoprocessor designs, which allow that elliptic curve based cryptosystems implemented in hardware provide more physical security and higher speed than software implementations. In this case, the multipliers were designed using conventional, modified and fast multiplication algorithms, the synthesis and simulation were carried out using Quartus II v.5.0 of Altera, and the designs were synthesized on the Stratix II EP2S60F1020C3. The simulation results show that the multipliers designed present a very good performance using small area.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملNormal Basis Multiplication Algorithm for GF ( 2 n ) ( Full Version )
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کاملNormal Basis Multiplication Algorithms for GF(2n) (Full Version)
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کاملDesign of Polynomial Basis Multipliers over Gf(2)
This article addresses an efficient hardware implementations for multiplication over finite field GF(2). Multiplication in GF(2) is very commonly used in cryptography and error correcting codes. An efficient hardware could reduce the cost and development for these applications. This work presents the hardware implementation of polynomial basis. In this case, the multipliers were designed using ...
متن کاملPolynomial Basis Multipliers for Irreducible Trinomials
We show that the step “modulo the degree-n field generating irreducible polynomial” in the classical definition of the GF (2) multiplication operation can be avoided. This leads to an alternative representation of the finite field multiplication operation. Combining this representation and the Chinese Remainder Theorem, we design bit-parallel GF (2) multipliers for irreducible trinomials u + u ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005